Geometric Complexity Theory: Introduction

نویسندگان

  • Ketan Mulmuley
  • Milind A. Sohoni
چکیده

Foreword These are lectures notes for the introductory graduate courses on geometric complexity theory (GCT) in the computer science department, the university of Chicago. Part I consists of the lecture notes for the course given by the first author in the spring quarter, 2007. It gives introduction to the basic structure of GCT. Part II consists of the lecture notes for the course given by the second author in the spring quarter, 2003. It gives introduction to invariant theory with a view towards GCT. No background in algebraic geometry or representation theory is assumed. These lecture notes in conjunction with the article [GCTflip1], which describes in detail the basic plan of GCT based on the principle called the flip, should provide a high level picture of GCT assuming familiarity with only basic notions of algebra, such as groups, rings, fields etc. Many of the theorems in these lecture notes are stated without proofs, but after giving enough motivation so that they can be taken on faith. For the readers interested in further study, Figure 1 shows logical dependence among the various papers of GCT and a suggested reading sequence. for taking notes for his lectures.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric Complexity Theory: an introduction for geometers

This article is survey of recent developments in, and a tutorial on, the approach to P v. NP and related questions called Geometric Complexity Theory (GCT). It is written to be accessible to graduate students. Numerous open questions in algebraic geometry and representation theory relevant for GCT are presented.

متن کامل

An introduction to geometric complexity theory

I survey methods from differential geometry, algebraic geometry and representation theory relevant for the permanent v. determinant problem from computer science, an algebraic analog of the P v. NP problem.

متن کامل

Permanent versus determinant, obstructions, and Kronecker coefficients

We give an introduction to some of the recent ideas that go under the name “geometric complexity theory”. We first sketch the proof of the known upper and lower bounds for the determinantal complexity of the permanent. We then introduce the concept of a representation theoretic obstruction, which has close links to algebraic combinatorics, and we explain some of the insights gained so far. In p...

متن کامل

9 On P vs . NP , Geometric Complexity Theory , Explicit Proofs and the Complexity Barrier Dedicated to Sri Ramakrishna

Geometric complexity theory (GCT) is an approach to the P vs. NP and related problems. This article gives its complexity theoretic overview without assuming any background in algebraic geometry or representation theory.

متن کامل

On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier

Geometric complexity theory (GCT) is an approach to the P vs. NP and related problems. This article gives its complexity theoretic overview without assuming any background in algebraic geometry or representation theory.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0709.0746  شماره 

صفحات  -

تاریخ انتشار 2007